排序方式: 共有90条查询结果,搜索用时 453 毫秒
1.
针对同时存在恶意干扰与非法窃听的通信环境,提出一种协作干扰(cooperative jamming, CJ)掩护的保密通信架构,收发信机之间采用跳频技术躲避恶意干扰,并采用协作干扰技术阻塞非法窃听。但该架构的通信带宽较大,会在收发频率振荡器中引起显著的同相和正交(in-phase and quadrature, IQ)通道失衡。鉴于此,对收发IQ通道失衡引起的信号失真进行数学建模,给出接收机处信干噪比的数学表达式,并给出干扰抑制比的闭合表达式。仿真结果表明,收发IQ通道失衡引起的信号失真的功率远大于热噪声功率。随着收发IQ通道失衡加剧,所提架构的信干噪比和干扰抑制比性能均会急剧下降,当幅度和相位失衡分别达到0.95和π/50时,信干噪比和干扰抑制比均损失了47 dB。 相似文献
2.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
3.
在基因芯片实验中,数据缺失客观存在,并在一定程度上影响芯片数据后续分析结果的准确性。在不增加实验次数的情况下,缺失值估计是降低缺失数据对后续分析影响的有效方法。利用相似性信息的核加权函数来实现缺失值回归估计的局部化,提出了基于加权回归估计的基因表达缺失值估计算法。在两个不同类型的基因芯片数据上,将新方法与几种已知的方法进行了比较分析。实验结果表明,新的估计算法具有比传统缺失值估计算法更好的稳定性和估计准确度。 相似文献
4.
一幅图像可以分解为匀质结构图和几何纹理图两个分量.基于这种思想,提出了一种使用二代Bandelet和小波对图像进行分层压缩的有效算法.首先,使用全变分方法把原始图像f分解为u和v两部分,其中u代表f中的结构分量,v代表纹理分量;对u进行小波变换,对v进行二代Bandelet变换.采用了自顶向下的四叉树分解算法,优化了二代Bandelet的四叉树建立过程.实验结果表明,该压缩方法的重建图像在视觉效果和客观SSIM值两方面均优于JPEG2000和Bandelets. 相似文献
5.
6.
7.
针对基于马氏距离的重要性测度存在的问题,提出了基于谱分解加权摩尔彭罗斯马氏距离的重要性测度指标,通过构造多输出协方差阵的广义逆矩阵以及谱分解的策略,有效解决了协方差阵求逆奇异情况以及由于未能充分考虑多输出之间的相互关系而导致的错误识别重要变量的问题,克服了基于马氏距离指标的局限性。数值算例与工程算例结果表明:所提重要性测度可以更加准确地获得输入变量对结构系统多输出性能随机取值特征贡献的排序,从而为可靠性设计提供充分的信息。 相似文献
8.
Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness 下载免费PDF全文
We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines Mj, and the Mj subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017 相似文献
9.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014 相似文献
10.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献